A Comparison of Several Greatest Common Divisor (GCD) Algorithms

This paper about Greater Common Divisor GCD, the paper shows that there is a lot of algorithms, some of these algorithm is good in timing and make low number of iteration, the other make a lot of iteration with a lot of time! But as we see in the analysis of the algorithms that some of the algorithms is faster than the others in small numbers (like Brute force is faster than Bishop Algorithm in the small numbers, but in the large numbers the Bishop Algorithm is too fast with comparison with the brute force) so the researchers recommend to develop the Bishop algorithm the make it more efficient in computing the GCD for small numbers. In the other hand the Dijkstra algorithm is too close in timing and number of iteration with the Bishop algorithm. But as we see in the analysis the best algorithm to use in computing the GCD in all type of integers is the Extended Euclidean algorithm which makes few loops with small or large numbers.